Phrase structure grammars generating context-free languages
نویسندگان
چکیده
منابع مشابه
An Efficient Context-Free Parser For Augmented Phrase-Structure Grammars
In this paper we present an efficient context-free (CF) bottom-up, non deterministic parser. It is an extension of the ICA (Immediate Constituent Analysis) parser proposed by Grishman (1976), and its major improvements are described. It has been designed to run Augmented Phrase-Structure Grammars (APSG) and performs semantic interpretation in parallel with syntactic analysis. It has been implem...
متن کاملPhrase Structure Grammars and Natural Languages
D u r i n g most o f t he l a s t two decades , c o m p u t a t i o n a l l i n g u i s t s and A I r e s e a r c h e r s w o r k i n g o n n a t u r a l language have assumed t h a t phrase s t r u c t u r e grammars, d e s p i t e t h e i r c o m p u t a t i o n a l t r a c t a b i l i t y , were u n s a t i s f a c t o r y d e v i c e s f o r e x p r e s s i n g the s y n t a x o f n a t u r...
متن کاملGenerating Context-Free Grammars using Classical Planning
This paper presents a novel approach for generating Context-Free Grammars (CFGs) from small sets of input strings (a single input string in some cases). Our approach is to compile this task into a classical planning problem whose solutions are sequences of actions that build and validate a CFG compliant with the input strings. In addition, we show that our compilation is suitable for implementi...
متن کاملSome Results on Small Context-free Grammars Generating Primitive Words
In this report we characterize all context-free grammars with not more than three nonterminals generating only primitive words. 1This work was supported by the German-Hungarian Research Project 102 of OMFB ( Hungarian Research Foundation ) and Project X 233.6 of Forschungszentrum Karlsruhe
متن کاملStochastic Context-Free Grammars, Regular Languages, and Newton's Method
We study the problem of computing the probability that agiven stochastic context-free grammar (SCFG), G, generates a string ina given regular language L(D) (given by a DFA, D). This basic problemhas a number of applications in statistical natural language processing,and it is also a key necessary step towards quantitative ω-regular modelchecking of stochastic context-free pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1975
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(75)90426-x